Fast Transformation of Temporal Plans for Efficient Execution
نویسندگان
چکیده
Temporal plans permit significant flexibility in specifying the occurrence time of events. Plan execution can make good use of that flexibility. However, the advantage of execution flexibility is counterbalanced by the cost during execution of propagating the time of occurrence of events throughout the flexible plan. To minimize execution latency, this propagation needs to be very efficient. Previous work showed that every temporal plan can be reformulated as a dispatchable plan, i.e., one for which propagation to immediate neighbors is sufficient. A simple algorithm was given that finds a dispatchable plan with a minimum number of edges in cubic time and quadratic space. In this paper, we focus on the efficiency of the reformulation process, and improve on that result. A new algorithm is presented that uses linear space and has time complexity equivalent to Johnson’s algorithm for all-pairs shortest-path problems. Experimental evidence confirms the practical effectiveness of the new algorithm. For example, on a large commercial application, the performance is improved by at least two orders of magnitude. We further show that the dispatchable plan, already minimal in the total number of edges, can also be made minimal in the maximum number of edges incoming or outgoing at any node.
منابع مشابه
Fast Transformation of Temporal Plans for E cient
Temporal plans permit signiicant exibility in specifying the occurrence time of events. Plan execution can make good use of that exibility. However, the advantage of execution exibility is counterbalanced by the cost during execution of propagating the time of occurrence of events throughout the exible plan. To minimize execution latency, this propagation needs to be very eecient. Previous work...
متن کاملExecution of Temporal Plans with Uncertainty
Simple Temporal Networks (STNs) have proved useful in applications that involve metric time. However, many applications involve events whose timing is uncertain in the sense that it is not controlled by the execution agent. In this paper we consider execution algorithms for temporal networks that include events of uncertain timing. We present two such algorithms. The first retains maximum flexi...
متن کاملFast Dynamic Scheduling of Disjunctive Temporal Constraint Networks through Incremental Compilation
Autonomous systems operating in real-world environments must plan, schedule, and execute missions while robustly adapting to uncertainty and disturbance. One way to mitigate the effect of uncertainty and disturbance is to dynamically schedule the plan online, through dispatchable execution. Dispatchable execution increases the efficiency of plan execution by introducing (1) a compiler that redu...
متن کاملImproving the Execution of Clinical Guidelines and Temporal Data Abstraction High-Frequency Domains
The execution of clinical guidelines and protocols (CGPs) is a challenging task in high-frequency domains such as Intensive Care Units. On the one hand, sophisticated temporal data abstraction is required to match the low-level information from monitoring devices and electronic patient records with the high-level concepts in the CGPs. On the other hand, the frequency of the data delivered by mo...
متن کامل